Minor-universal planar graphs without accumulation points
نویسنده
چکیده
We show that the countably infinite union of infinite grids, H say, is minor-universal in the class of all graphs that can be drawn in the plane without vertex accumulation points, i.e. that H contains every such graph as a minor. Furthermore, we characterize the graphs that occur as minors of the infinite grid by a natural topological condition on their embeddings.
منابع مشابه
On Universal Point Sets for Planar Graphs
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...
متن کاملUniversal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کاملUniversal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کاملUniversal Point Subsets for Planar Graphs
A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S. In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a universal point subset of size k? We provide a...
متن کاملAdapted list colouring of planar graphs
Given a (possibly improper) edge-colouring F of a graph G, a vertex colouring of G is adapted to F if no colour appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L to the vertices of G, with |L(v)| ≥ k for all v, and any edgecolouring F of G, G admits a colouring c adapted to F where c(v) ∈ L(v) for all v, then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 36 شماره
صفحات -
تاریخ انتشار 2001